Learning temporal attention in dynamic graphs with bilinear interactions

نویسندگان

چکیده

Reasoning about graphs evolving over time is a challenging concept in many domains, such as bioinformatics, physics, and social networks. We consider common case which edges can be short term interactions (e.g., messaging) or long structural connections friendship). In practice, are often specified by humans. Human-specified both expensive to produce suboptimal for the downstream task. To alleviate these issues, we propose model based on temporal point processes variational autoencoders that learns infer attention between nodes observing node communication. As drives between-node feature propagation, using dynamics of learn this key component provides more flexibility while simultaneously avoiding issues associated with human-specified edges. also bilinear transformation layer pairs features instead concatenation, typically used prior work, demonstrate its superior performance all cases. experiments two datasets dynamic link prediction task, our outperforms baseline requires graph. Moreover, learned semantically interpretable infers similar actual graphs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deep Learning with Dynamic Computation Graphs

Neural networks that compute over graph structures are a natural fit for problems in a variety of domains, including natural language (parse trees) and cheminformatics (molecular graphs). However, since the computation graph has a different shape and size for every input, such networks do not directly support batched training or inference. They are also difficult to implement in popular deep le...

متن کامل

Testing Temporal Connectivity in Sparse Dynamic Graphs

We address the problem of testing whether a given dynamic graph is temporally connected, i.e. a temporal path (also called a journey) exists between all pairs of vertices. We consider a discrete version of the problem, where the topology is given as an evolving graph G = {G1, G2, ..., Gk} whose set of vertices is invariant and the set of (directed) edges varies over time. Two cases are studied,...

متن کامل

Representation Learning over Dynamic Graphs

How can we effectively encode evolving information over dynamic graphs into low-dimensional representations? In this paper, we propose DyRep – an inductive deep representation learning framework that learns a set of functions to efficiently produce low-dimensional node embeddings that evolves over time. The learned embeddings drive the dynamics of two key processes namely, communication and ass...

متن کامل

The Relationship between Psychological Capital and Students’ Learning Empowerments: Testing the Mediation Role of Dynamic Interactions

This research aimed to investigate the relationships between psychological capital, learning empowerment, and dynamic interactions in students of Shahrood University of Medical Sciences. With regard to the ways data were collected, the present study is descriptive correlational and is specifically based on structural equitation modeling in which maximum likelihood estimation with adjusting skew...

متن کامل

Learning to Negate Adjectives with Bilinear Models

We learn a mapping that negates adjectives by predicting an adjective’s antonym in an arbitrary word embedding model. We show that both linear models and neural networks improve on this task when they have access to a vector representing the semantic domain of the input word, e.g. a centroid of temperature words when predicting the antonym of ‘cold’. We introduce a continuous class-conditional ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: PLOS ONE

سال: 2021

ISSN: ['1932-6203']

DOI: https://doi.org/10.1371/journal.pone.0247936